منابع مشابه
Information Filtering in Changing Domains
The task of information ltering is to classify documents from a stream into either relevant or irrelevant according to a particular user interest with the objective to reduce information load. When using an information lter in an environment that is changing as time proceeds, methods for adapting the lter should be considered in order to retain the desired accuracy in classiication. We favor a ...
متن کاملAssociation Mining in Gradually Changing Domains
Association mining explores algorithms capable of detecting frequently co-occurring items in transactions. A transaction can be identified with a market basket—a list of items a customer pays for at the checkout desk. In this paper, we explore a framework for the detection of changes in the buying patterns, as affected by fashion, season, or the introduction of a new product. We present several...
متن کاملBest Information Planning for Unknown, Uncertain, and Changing Domains
Planning operations for an autonomous agent is a much-studied problem. Most solutions require that the agent’s domain be fully known at the time of planning and fixed during execution. For many domains, however, this is not possible. One approach to the problem is to construct an initial plan based on the best information a priori and revise the plan during execution as better information becom...
متن کاملDiscovering Domains Mediating Protein Interactions
Background: Protein-protein interactions do not provide any direct information regarding the domains within the proteins that mediate the interactions. The majority of proteins are multi domain proteins and the interaction between them is often defined by the pairs of their domains. Most of the former studies focus only on interacting domain pairs. However they do not consider the in...
متن کاملA Genetic Algorithm Using Changing Environments for Pathfinding in Continuous Domains
This paper describes a technique for finding paths through a two dimensional continuous space using a genetic algorithm. While A* currently dominates the field of pathfinding, it requires that the space be discretized. For spaces which are not easily discretized, or in which a fixed grid size is not permissible, a pathfinding algorithm which does not require discretization is necessary. In addi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Materials
سال: 2013
ISSN: 1476-1122,1476-4660
DOI: 10.1038/nmat3767